منابع مشابه
Deterministic Dictionaries
It is shown that a static dictionary that offers constant-time access to n elements with w-bit keys and occupies O(n) words of memory can be constructed deterministically in O(n log n) time on a unit-cost RAM with word length w and a standard instruction set including multiplication. Whereas a randomized construction working in linear expected time was known, the running time of the best previo...
متن کاملFaster deterministic integer factorization
The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(Mint(N 1/4 logN)), where Mint(k) denotes the cost of multiplying k-bit integers. This result is due to Bostan–Gaudry–Schost, following the Pollard–Strassen approach. We show that this bound can be improved by a factor of √
متن کاملFaster deterministic Feedback Vertex Set
We present two new deterministic algorithms for the Feedback Vertex Set problem parameterized by the solution size. We begin with a simple algorithm, which runs in O((2 + φ)) time, where φ < 1.619 is the golden ratio. It already surpasses the previously fastest O((1+ 2 √ 2))-time deterministic algorithm due to Cao et al. [SWAT 2010]. In our developments we follow the approach of Cao et al., how...
متن کاملA New Trade-Off for Deterministic Dictionaries
We consider dictionaries over the universe U = {0, 1} on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with membership queries in time (log logn) and updates in time (logn), where n is the size of the set stored. This is the first such data structure to simultaneously achieve query time (logn) and update time O(2 c ) for a co...
متن کاملOn some deterministic dictionaries supporting sparsity
We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups. The oscillator dictionary consists of approximately p unit vectors in a Hilbert space of dimension p, whose pairwise inner products have magnitude of at most 4/ √ p. An explicit algorithm to construct a large portio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1999
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v6i48.20118